0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.12	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.33	% Computer   : n007.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 12:26:50 EDT 2021
0.12/0.34	% CPUTime    : 
0.12/0.34	% Number of cores: 8
0.12/0.34	% Python version: Python 3.6.8
0.19/0.34	# Version: 2.6rc1-ho
0.19/0.34	# No SInE strategy applied
0.19/0.34	# Trying AutoSched0 for 59 seconds
0.19/0.39	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S087N
0.19/0.39	# and selection function SelectCQArNpEqFirstUnlessPDom.
0.19/0.39	#
0.19/0.39	# Preprocessing time       : 0.030 s
0.19/0.39	# Presaturation interreduction done
0.19/0.39	
0.19/0.39	# Proof found!
0.19/0.39	# SZS status Theorem
0.19/0.39	# SZS output start CNFRefutation
0.19/0.39	thf(dpsetconstrEL1, conjecture, ((![X1:$i, X5:$i, X8:$i > $i > $o, X3:$i, X4:$i]:(in @ (kpair @ X3 @ X4) @ (dpsetconstr @ X1 @ X5 @ (^[X9:$i, X7:$i]:X8 @ X9 @ X7))=>in @ X3 @ X1)<=cartprodpairmemEL)<=dsetconstrEL), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dpsetconstrEL1)).
0.19/0.39	thf(dsetconstrEL, axiom, (dsetconstrEL<=>![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:X2 @ X4))=>in @ X3 @ X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dsetconstrEL)).
0.19/0.39	thf(cartprodpairmemEL, axiom, (cartprodpairmemEL<=>![X1:$i, X5:$i, X3:$i, X4:$i]:(in @ (kpair @ X3 @ X4) @ (cartprod @ X1 @ X5)=>in @ X3 @ X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cartprodpairmemEL)).
0.19/0.39	thf(dpsetconstr, axiom, (dpsetconstr)=(^[X1:$i, X5:$i, X6:$i > $i > $o]:dsetconstr @ (cartprod @ X1 @ X5) @ (^[X7:$i]:?[X3:$i]:(in @ X3 @ X1&?[X4:$i]:((in @ X4 @ X5&X6 @ X3 @ X4)&(X7)=(kpair @ X3 @ X4))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dpsetconstr)).
0.19/0.39	thf(c_0_4, plain, ![X4:$i, X2:$i > $o]:(epred3_2 @ X2 @ X4<=>X2 @ X4), introduced(definition)).
0.19/0.39	thf(c_0_5, plain, ![X7:$i, X9:$i, X8:$i > $i > $o]:(epred2_3 @ X8 @ X9 @ X7<=>X8 @ X9 @ X7), introduced(definition)).
0.19/0.39	thf(c_0_6, plain, ![X22:$i, X1:$i, X5:$i, X6:$i > $i > $o]:(epred1_4 @ X6 @ X5 @ X1 @ X22<=>?[X23:$i]:(in @ X23 @ X1&?[X24:$i]:((in @ X24 @ X5&X6 @ X23 @ X24)&(X22)=(kpair @ X23 @ X24)))), introduced(definition)).
0.19/0.39	thf(c_0_7, negated_conjecture, ~((![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (epred3_2 @ X2))=>in @ X3 @ X1)=>(![X1:$i, X5:$i, X3:$i, X4:$i]:(in @ (kpair @ X3 @ X4) @ (cartprod @ X1 @ X5)=>in @ X3 @ X1)=>![X1:$i, X5:$i, X8:$i > $i > $o, X3:$i, X4:$i]:(in @ (kpair @ X3 @ X4) @ (dpsetconstr @ X1 @ X5 @ (epred2_3 @ X8))=>in @ X3 @ X1)))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[dpsetconstrEL1]), dsetconstrEL]), cartprodpairmemEL]), c_0_4]), c_0_5])])).
0.19/0.39	thf(c_0_8, plain, ![X1:$i, X5:$i, X6:$i > $i > $o]:(dpsetconstr @ X1 @ X5 @ X6)=(dsetconstr @ (cartprod @ X1 @ X5) @ (epred1_4 @ X6 @ X5 @ X1)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[dpsetconstr]), c_0_6])).
0.19/0.39	thf(c_0_9, negated_conjecture, ![X28:$i, X29:$i > $o, X30:$i, X31:$i, X32:$i, X33:$i, X34:$i]:((~in @ X30 @ (dsetconstr @ X28 @ (epred3_2 @ X29))|in @ X30 @ X28)&((~in @ (kpair @ X33 @ X34) @ (cartprod @ X31 @ X32)|in @ X33 @ X31)&(in @ (kpair @ esk3_0 @ esk4_0) @ (dpsetconstr @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))&~in @ esk3_0 @ esk1_0))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])).
0.19/0.39	thf(c_0_10, plain, ![X25:$i, X26:$i, X27:$i > $i > $o]:(dpsetconstr @ X25 @ X26 @ X27)=(dsetconstr @ (cartprod @ X25 @ X26) @ (epred1_4 @ X27 @ X26 @ X25)), inference(variable_rename,[status(thm)],[c_0_8])).
0.19/0.39	thf(c_0_11, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(in @ X1 @ X3|~in @ X1 @ (dsetconstr @ X3 @ (epred3_2 @ X2))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.39	thf(c_0_12, plain, ![X6:$i > $i > $o, X3:$i, X1:$i]:(dpsetconstr @ X1 @ X3 @ X6)=(dsetconstr @ (cartprod @ X1 @ X3) @ (epred1_4 @ X6 @ X3 @ X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.19/0.39	thf(c_0_13, plain, ![X1:$i, X2:$i > $o, X3:$i, X4:$i, X6:$i > $i > $o]:(in @ X1 @ (cartprod @ X3 @ X4)|(epred1_4 @ X6 @ X4 @ X3)!=(epred3_2 @ X2)|~in @ X1 @ (dpsetconstr @ X3 @ X4 @ X6)), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_11, c_0_12])])).
0.19/0.39	thf(c_0_14, plain, ![X2:$i > $o, X1:$i, X3:$i, X4:$i, X6:$i > $i > $o]:(in @ X1 @ (cartprod @ X3 @ X4)|(epred1_4 @ X6 @ X4 @ X3 @ (esk7_4 @ X2 @ X3 @ X4 @ X6))!=(epred3_2 @ X2 @ (esk7_4 @ X2 @ X3 @ X4 @ X6))|~in @ X1 @ (dpsetconstr @ X3 @ X4 @ X6)), inference(neg_ext,[status(thm)],[c_0_13])).
0.19/0.39	thf(c_0_15, plain, ![X55:$i, X56:$i > $o]:((~epred3_2 @ X56 @ X55|X56 @ X55)&(~X56 @ X55|epred3_2 @ X56 @ X55)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])).
0.19/0.39	thf(c_0_16, plain, ![X1:$i, X3:$i, X4:$i, X2:$i > $o, X6:$i > $i > $o]:(epred1_4 @ X6 @ X1 @ X3 @ (esk7_4 @ X2 @ X3 @ X1 @ X6)|epred3_2 @ X2 @ (esk7_4 @ X2 @ X3 @ X1 @ X6)|in @ X4 @ (cartprod @ X3 @ X1)|~in @ X4 @ (dpsetconstr @ X3 @ X1 @ X6)), inference(dynamic cnf,[status(thm)],[c_0_14])).
0.19/0.39	thf(c_0_17, negated_conjecture, in @ (kpair @ esk3_0 @ esk4_0) @ (dpsetconstr @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.39	thf(c_0_18, plain, ![X2:$i > $o, X1:$i]:(X2 @ X1|~epred3_2 @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_15])).
0.19/0.39	thf(c_0_19, negated_conjecture, ![X2:$i > $o]:(epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0 @ (esk7_4 @ X2 @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))|in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0)|epred3_2 @ X2 @ (esk7_4 @ X2 @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
0.19/0.39	thf(c_0_20, plain, ![X2:$i > $o]:(epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0 @ (esk7_4 @ X2 @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))|in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0)|X2 @ (esk7_4 @ X2 @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.19/0.39	thf(c_0_21, plain, ![X2:$i > $o, X1:$i]:(epred3_2 @ X2 @ X1|~X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_15])).
0.19/0.39	thf(c_0_22, plain, ![X2:$i > $o, X1:$i, X3:$i, X4:$i, X6:$i > $i > $o]:(in @ X1 @ (cartprod @ X3 @ X4)|~epred1_4 @ X6 @ X4 @ X3 @ (esk7_4 @ X2 @ X3 @ X4 @ X6)|~epred3_2 @ X2 @ (esk7_4 @ X2 @ X3 @ X4 @ X6)|~in @ X1 @ (dpsetconstr @ X3 @ X4 @ X6)), inference(dynamic cnf,[status(thm)],[c_0_14])).
0.19/0.39	thf(c_0_23, plain, (epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0 @ (esk7_4 @ (epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))|in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0)), inference(ef,[status(thm)],[c_0_20])).
0.19/0.39	thf(c_0_24, plain, ![X2:$i > $o]:(epred3_2 @ (epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0) @ (esk7_4 @ X2 @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))|epred3_2 @ X2 @ (esk7_4 @ X2 @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))|in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0)), inference(spm,[status(thm)],[c_0_21, c_0_19])).
0.19/0.39	thf(c_0_25, plain, ![X1:$i]:(in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0)|in @ X1 @ (cartprod @ esk1_0 @ esk2_0)|~epred3_2 @ (epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0) @ (esk7_4 @ (epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))|~in @ X1 @ (dpsetconstr @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))), inference(spm,[status(thm)],[c_0_22, c_0_23])).
0.19/0.39	thf(c_0_26, plain, (epred3_2 @ (epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0) @ (esk7_4 @ (epred1_4 @ (epred2_3 @ epred4_0) @ esk2_0 @ esk1_0) @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))|in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0)), inference(ef,[status(thm)],[c_0_24])).
0.19/0.39	thf(c_0_27, plain, ![X1:$i]:(in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0)|in @ X1 @ (cartprod @ esk1_0 @ esk2_0)|~in @ X1 @ (dpsetconstr @ esk1_0 @ esk2_0 @ (epred2_3 @ epred4_0))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.19/0.39	thf(c_0_28, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:(in @ X1 @ X4|~in @ (kpair @ X1 @ X3) @ (cartprod @ X4 @ X5)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.39	thf(c_0_29, negated_conjecture, in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0), inference(spm,[status(thm)],[c_0_27, c_0_17])).
0.19/0.39	thf(c_0_30, negated_conjecture, ~in @ esk3_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.39	thf(c_0_31, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30]), ['proof']).
0.19/0.39	# SZS output end CNFRefutation
0.19/0.39	# Proof object total steps             : 32
0.19/0.39	# Proof object clause steps            : 20
0.19/0.39	# Proof object formula steps           : 12
0.19/0.39	# Proof object conjectures             : 10
0.19/0.39	# Proof object clause conjectures      : 7
0.19/0.39	# Proof object formula conjectures     : 3
0.19/0.39	# Proof object initial clauses used    : 7
0.19/0.39	# Proof object initial formulas used   : 4
0.19/0.39	# Proof object generating inferences   : 9
0.19/0.39	# Proof object simplifying inferences  : 2
0.19/0.39	# Training examples: 0 positive, 0 negative
0.19/0.39	# Parsed axioms                        : 11
0.19/0.39	# Removed by relevancy pruning/SinE    : 0
0.19/0.39	# Initial clauses                      : 21
0.19/0.39	# Removed in clause preprocessing      : 7
0.19/0.39	# Initial clauses in saturation        : 14
0.19/0.39	# Processed clauses                    : 131
0.19/0.39	# ...of these trivial                  : 0
0.19/0.39	# ...subsumed                          : 2
0.19/0.39	# ...remaining for further processing  : 129
0.19/0.39	# Other redundant clauses eliminated   : 8
0.19/0.39	# Clauses deleted for lack of memory   : 0
0.19/0.39	# Backward-subsumed                    : 1
0.19/0.39	# Backward-rewritten                   : 9
0.19/0.39	# Generated clauses                    : 271
0.19/0.39	# ...of the previous two non-trivial   : 167
0.19/0.39	# Contextual simplify-reflections      : 0
0.19/0.39	# Paramodulations                      : 243
0.19/0.39	# Factorizations                       : 4
0.19/0.39	# NegExts                              : 1
0.19/0.39	# Equation resolutions                 : 8
0.19/0.39	# Propositional unsat checks           : 0
0.19/0.39	#    Propositional check models        : 0
0.19/0.39	#    Propositional check unsatisfiable : 0
0.19/0.39	#    Propositional clauses             : 0
0.19/0.39	#    Propositional clauses after purity: 0
0.19/0.39	#    Propositional unsat core size     : 0
0.19/0.39	#    Propositional preprocessing time  : 0.000
0.19/0.39	#    Propositional encoding time       : 0.000
0.19/0.39	#    Propositional solver time         : 0.000
0.19/0.39	#    Success case prop preproc time    : 0.000
0.19/0.39	#    Success case prop encoding time   : 0.000
0.19/0.39	#    Success case prop solver time     : 0.000
0.19/0.39	# Current number of processed clauses  : 103
0.19/0.39	#    Positive orientable unit clauses  : 86
0.19/0.39	#    Positive unorientable unit clauses: 0
0.19/0.39	#    Negative unit clauses             : 1
0.19/0.39	#    Non-unit-clauses                  : 16
0.19/0.39	# Current number of unprocessed clauses: 60
0.19/0.39	# ...number of literals in the above   : 153
0.19/0.39	# Current number of archived formulas  : 0
0.19/0.39	# Current number of archived clauses   : 25
0.19/0.39	# Clause-clause subsumption calls (NU) : 262
0.19/0.39	# Rec. Clause-clause subsumption calls : 196
0.19/0.39	# Non-unit clause-clause subsumptions  : 3
0.19/0.39	# Unit Clause-clause subsumption calls : 0
0.19/0.39	# Rewrite failures with RHS unbound    : 0
0.19/0.39	# BW rewrite match attempts            : 1403
0.19/0.39	# BW rewrite match successes           : 1
0.19/0.39	# Condensation attempts                : 0
0.19/0.39	# Condensation successes               : 0
0.19/0.39	# Termbank termtop insertions          : 7169
0.19/0.39	
0.19/0.39	# -------------------------------------------------
0.19/0.39	# User time                : 0.039 s
0.19/0.39	# System time              : 0.008 s
0.19/0.39	# Total time               : 0.047 s
0.19/0.39	# Maximum resident set size: 1656 pages
0.19/0.39	EOF